Nowadays, bulk of the designers prefer to outsource some parts of their design and fabrication process to the third-part companies due to the reliability problems, manufacturing cost and time-to-market limitations. In this situation, there are a lot of opportunities for malicious alterations by the off-shore companies. In this paper, we proposed a new PLACEMENT algorithm that hinders the hardware Trojan insertion or simplifies the detection process in existence of Trojans. Experimental results show that the proposed PLACEMENT improves the Trojan detectability of the attempted benchmarks against Trojan insertion more than 20% in reasonable cost in delay and wire length.

Efficient distribution of service requests between fog and cloud nodes considering user mobility and fog nodes’ overload is an important issue of fog computing. This paper proposes a heuristic method for task PLACEMENT considering the mobility of users, aiming to serve a higher number of requested services and minimize their response time. This method introduces a formula to overload prediction based on the entry-exit ratio of users and the estimated time required to perform current requests that are waiting in the queue of a fog node. Then, it provides a solution to avoid the predicted overloading of fog nodes by sending all delay-tolerant requests in the overloaded fog node’s queue to the cloud to reduce the time required for servicing delay-sensitive requests and to increase their acceptance rate. In addition, to prevent requests from being rejected when the mobile user leaves the coverage area of the current fog node, the requests in the current fog node’s queue will be transferred to the destination fog node. Simulation results indicate that the proposed method is effective in avoiding the overloading of the fog nodes and outperforms the existing methods in terms of response time and acceptance rate.

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behaviour, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. GossipTrust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on the concept of gossip. Despite its important contribution, this algorithm has deficiencies especially with high number of nodes that leads to high execution time and low accuracy in the results. In this paper, a grouped Gossip based Reputation Aggregation (GGRA) algorithm is proposed. In GGRA, GossipTrust is executed in each group between group members and between groups instead of executing in the whole network. Due to the reduction in the number of nodes and using strongly connected graph instead of a weakly one, gossip algorithm in GGRA is executed quickly. With grouping, not only reputation aggregation is expected to be more scalable, but also because of the decrement in the number of errors of the gossiped communication, the results get more accurate. The evaluation of the proposed algorithm and its comparison with GossipTrust confirms the expected results.

Improving testability during the early stages of High-level Synthesis (HLS) has several benefits including reduced test hardwar, overheads, reduced test costs, reduced design iterations, and significant improved fault coverage. In this paper, we present a novel REGISTER allocation algorithm which is based on weighted graph coloring, targeting testability improvement. In our REGISTER allocation method, several high-level testability parameters including sequential depth, sequential loop, and controllability/observability are considered. Experiments show using this REGISTER allocation method results in significant improvement in A TPG time and fault coverage.

A text messaging service, among other functions of mobile phones, allows mobile phone subscribers to send and receive alphanumeric characters and emoticons. The discourse of the text messages characterizes a kind of interaction, mostly on the boundary between verbal and visual communication. Adopting Halliday's Socio-semiotic Model of Language, this study considered three REGISTER variables of filed, mode, and tenor in a text message corpus comprising 2440 text messages collected from 122 medical students at Ahvaz Jundishapur University of Medical Sciences to investigate how the discourse of text message can be affected by the sociolinguistic dimensions of the context of language use. To that end, text messages were analyzed and categorized in term of the social interaction that constituted the content of the messages. The findings revealed that mobile phone text messaging is an asynchronous mode of communication which is characterized with particular REGISTER variables, and there are also pragmatic reasons in addition to the technical restrictions for the creation of this REGISTER as its users actively and selectively make use of the resources of spoken and written discourses in constructing the message.

The main portion of the power consumption in high speed REGISTER files is related to read out paths which are implemented using the dynamic circuits. For this reason, a new dynamic circuit technique is proposed in this paper to reduce the power consumption of the REGISTER files without significant speed and noise immunity degradation. In the proposed dynamic circuit, the pull down network is partitioned to the some smaller pull down networks to increase the circuit performance. Moreover, pull-down networks are precharged using NMOS transistors to reduce the voltage swing and hence decrease the power consumption. A 64-word x 32-bit 2-read, 1-write ported REGISTER file is implemented using the proposed circuit technique. Simulation of REGISTER files are performed using HSPICE simulator in low-Vth 90-nm CMOS technology model. Simulation results demonstrate 37% and 36% reduction in power and delay respectively at the same noise immunity compared to the conventional REGISTER file.